Improved Probabilistic Routing on Generalized Hypercubes
نویسندگان
چکیده
p. 1 Efficient Data Communication in Incomplete Hypercubes p. 13 Efficient Communication in the Folded Petersen Interconnection Networks p. 25 Compiling Rewriting onto SIMD and MIMD/SIMD Machines p. 37 A Compilation Technique for Varying Communication Cost NUMA Architectures p. 49 A Data Partitioning Algorithm for Distributed Memory Compilation p. 61 Towards a High Precision Massively Parallel Computer p. 73 On the Testability of Purely Recursive Digital Filters p. 85 Voting on Synchronous Communications p. 97 Protocol Validation: A Parallel Technique to Reduce the Reachability Tree p. 109 Optimal Parallel Execution of Complete Binary Trees and Grids into Most Popular Interconnection Networks p. 122
منابع مشابه
Routing and Embeddings in Cyclic Petersen Networks: An Efficient Extension of the Petersen Graph
The Petersen graph is a Moore graph that has node degree 3, diameter 2, and optimal network size 10. In this paper, we present a class of interconnection networks, called cyclic Petersen networks (CPNs), which efficiently extend the Petersen graph to obtain larger networks with small diameter and node degree. We derive balanced routing algorithms and efficient embeddings for CPNs. In particular...
متن کاملThe Priority Broadcast Scheme for Dynamic Broadcast in Hypercubes and Related Networks
Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process. The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an ndimensional hypercube is Ω(n+ 1 1 ρ)when packets are generated according to a Poisson process, where ρ is the load facto...
متن کاملOptimal Routing for Odd-Even Rotations on BRGC Hypercubes
It has been an open problem for a long time whether there exists an optimal routing algorithm for rotations on BRGC hypercubes such that all the paths are shortest and link-disjoint. In this paper, we consider the routing problem of odd-even rotations on BRGC hypercubes. It is a generalization of the rotation problem on BRGC hypercubes such that even nodes and odd nodes can have different rotat...
متن کاملTCN: Scalable Hierarchical Hypercubes
Hierarchical hypercubes, such as Extended Hypercube (EH), Hyperweave (HW), and Extended Hypercube with Cross Connections (EHC), have been proposed to overcome the scalability limitation of conventional hypercubes through the use of fixed dimension hypercubes of processing elements (PEs) as basic modules interconnected by network controllers (NC) which are themselves interconnected into hypercub...
متن کاملD.D.KOUVATSOS et al: PERFORMANCE MODELLING OF WORMHOLE-ROUTED PERFORMANCE MODELLING OF WORMHOLE-ROUTED HYPERCUBES WITH BURSTY TRAFFIC AND FINITE BUFFERS
An open queueing network model (QNM) is proposed for wormhole-routed hypercubes with finite buffers and deterministic routing subject to a compound Poisson arrival process (CPP) with geometrically distributed batches or, equivalently, a generalised exponential (GE) interarrival time distribution. The GE/G/1/K queue and appropriate GE-type flow formulae are adopted, as cost-effective building bl...
متن کامل